Derivations on $p$-adic fields

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring Polynominals over p-Adic Fields

We give an efficient algorithm for factoring polynomials over finite algebraic extensions of the p-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.

متن کامل

Simultaneous diagonal equations over p-adic fields

with coefficients aij in O. Write the degree as k = pm with p m. A solution x = (x1, . . . , xN) ∈ K is called non-trivial if at least one xj is non-zero. It is a special case of a conjecture of Emil Artin that (∗) has a non-trivial solution whenever N > Rk. This conjecture has been verified by Davenport and Lewis for a single diagonal equation over Qp and for a pair of equations of odd degree ...

متن کامل

Nearly Quadratic Mappings over p-Adic Fields

and Applied Analysis 3 As a special case, if n 2 in 1.3 , then we have the functional equation 1.2 . Also, if n 3 in 1.3 , we obtain 2 ∑ i1 2 3 ∑ i2 i1 1 f ⎛ ⎝ 3 ∑ i 1, i / i1,i2 xi − 2 ∑ r 1 xir ⎞ ⎠ 3 ∑ i1 2 f ⎛ ⎝ 3 ∑ i 1, i / i1 xi − xi1 ⎞ ⎠ f ( 3 ∑

متن کامل

Quantifier Elimination in p-adic Fields

We present a tutorial survey of quantifier-elimination and decision procedures in p-adic :fieIds. The p-adic :fieIds are studied in the (so-called) P,,-formalism of Angus Macintyre, for whieh motivation is provided through a rieh body of analogies with real-closed :fields. Quantifier-elimination and decision procedures are described proceeding via a Cylindrical Algebraic Decomposition of affine...

متن کامل

Fast arithmetic in unramified p-adic fields

Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common operations in Zpn modulo p . Combining existing methods with recent work of Kedlaya and Umans about modular composition of polynomials, we achieve quasi-linear time algorithms in the parameters n and N , and quasi-linea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1962

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1962-0143759-4